Sublinear time algorithms in the theory of groups and semigroups
نویسنده
چکیده
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a small portion of the input. The most typical situation where sublinear time algorithms are considered is property testing. There are several interesting contexts where one can test properties in sublinear time. A canonical example is graph colorability. To tell that a given graph is not k-colorable, it is often sufficient to inspect just one vertex with incident edges: if the degree of a vertex is greater than k, then the graph is not k-colorable. It is a challenging and interesting task to find algebraic properties that could be tested in sublinear time. In this paper, we address several algorithmic problems in the theory of groups and semigroups that may admit sublinear time solution, at least for “most” inputs.
منابع مشابه
Fuzzy Acts over Fuzzy Semigroups and Sheaves
lthough fuzzy set theory and sheaf theory have been developed and studied independently, Ulrich Hohle shows that a large part of fuzzy set theory is in fact a subfield of sheaf theory. Many authors have studied mathematical structures, in particular, algebraic structures, in both categories of these generalized (multi)sets. Using Hohle's idea, we show that for a (universal) algebra $A$, th...
متن کاملAmenability of groups and semigroups characterized by configuration
In 2005, A. Abdollahi and A. Rejali, studied the relations betweenparadoxical decomposition and configuration for semigroups. In thepresent paper, we introduce one other concept of amenability typeon semigroups and groups which includes amenability of semigroupsand inner-amenability of groups. We have extend the previous knownresults to semigroups and groups satisfying this concept.
متن کاملFREE SEMIGROUPS AND IDEMPOTENTS IN T
The known theory for an oid T shows how to find a subset T of ?T, which is a compact right topological semigroup [I]. The success of the methods in [2] for obtaining properties of-T has prompted us to see how successful they would be in another context. Thus we find (Theorem 4.8) that T cont ains copies of free semigroups on 2? generators, is an immediate consequence of the stronger resu...
متن کاملDesigning Stochastic Cell Formation Problem Using Queuing Theory
This paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. In this research, cells are defined as a queue system which will be optimized via queuing theory. In this queue system, each machine is assumed as a server and each part as a customer. The grouping of machines and parts...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1105.3252 شماره
صفحات -
تاریخ انتشار 2010